SIAM Journal on Discrete Mathematics -- January 2006

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Discrete Mathematics

ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 20, Issue 1, pp. 1-271

Please Note: Electronic articles are available well in advance of the printed articles.

Girth, Pebbling, and Grid Thresholds

Andrzej Czygrinow and Glenn Hurlbert

pp. 1-10

BibTeX Abstract Full Text: PDF

Computing Optimal Morse Matchings

Michael Joswig and Marc E. Pfetsch

pp. 11-25

BibTeX Abstract Full Text: PDF

Randomized Pursuit-Evasion with Local Visibility

Volkan Isler, Sampath Kannan, and Sanjeev Khanna

pp. 26-41

BibTeX Abstract Full Text: PDF

Odd Hole Recognition in Graphs of Bounded Clique Size

Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, and Giacomo Zambelli

pp. 42-48

BibTeX Abstract Full Text: PDF

Avoiding Patterns in Matrices Via a Small Number of Changes

Maria Axenovich and Ryan Martin

pp. 49-54

BibTeX Abstract Full Text: PDF

A Theorem About a Contractible and Light Edge

Zdenvek Dvorák and Riste Skrekovski

pp. 55-61

BibTeX Abstract Full Text: PDF

Improved Bounds for Topological Cliques in Graphs of Large Girth

Daniela Kühn and Deryk Osthus

pp. 62-78

BibTeX Abstract Full Text: PDF

Optimum Secret Sharing Scheme Secure against Cheating

Wakaha Ogata, Kaoru Kurosawa, and Douglas R. Stinson

pp. 79-95

BibTeX Abstract Full Text: PDF

Differential Methods for Finding Independent Sets in Hypergraphs

Yusheng Li and Wenan Zang

pp. 96-104

BibTeX Abstract Full Text: PDF

Linear Orderings of Subfamilies of AT-Free Graphs

Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, and Lorna Stewart

pp. 105-118

BibTeX Abstract Full Text: PDF

Embedding k-Outerplanar Graphs into l1

Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair

pp. 119-136

BibTeX Abstract Full Text: PDF

Ranking Tournaments

pp. 137-142

BibTeX Abstract Full Text: PDF

The Linking Probability of Deep Spider-Web Networks

Nicholas Pippenger

pp. 143-159

BibTeX Abstract Full Text: PDF

Full Rank Tilings of Finite Abelian Groups

pp. 160-170

BibTeX Abstract Full Text: PDF

Discrete Point X-rays

Paolo Dulio, Richard J. Gardner, and Carla Peri

pp. 171-188

BibTeX Abstract Full Text: PDF

Improved Bounds for the Crossing Numbers of Km,n and Kn

E. de Klerk, J. Maharry, D. V. Pasechnik, R. B. Richter, and G. Salazar

pp. 189-202

BibTeX Abstract Full Text: PDF

Pairwise colliding permutations and the capacity of infinite graphs

János Körner and Claudia Malvenuto

pp. 203-212

BibTeX Abstract Full Text: PDF

M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem

pp. 213-226

BibTeX Abstract Full Text: PDF

On Stability, Error Correction, and Noise Compensation in Discrete Tomography

Andreas Alpers and Peter Gritzmann

pp. 227-239

BibTeX Abstract Full Text: PDF

Collective tree spanners of graphs

Feodor F. Dragan, Chenyu Yan, and Irina Lomonosov

pp. 240-260

BibTeX Abstract Full Text: PDF

The Steiner k-Cut Problem

Chandra Chekuri, Sudipto Guha, and Joseph (Seffi) Naor

pp. 261-271

BibTeX Abstract Full Text: PDF